Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Triangulation Delaunay")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 582

  • Page / 24
Export

Selection :

  • and

Flipping to robustly delete a vertex in a delaunay tetrahedralizationLEDOUX, Hugo; GOLD, Christopher M; BACIU, George et al.Lecture notes in computer science. 2005, pp 737-747, issn 0302-9743, isbn 3-540-25860-4, 4Vol, 11 p.Conference Paper

On the average length of Delaunay triangulationsCHANG, R. C; LEE, R. C. T.BIT (Nordisk Tidskrift for Informationsbehandling). 1984, Vol 24, Num 3, pp 269-273, issn 0006-3835Article

Improvements on Sloan's algorithm for constructing Delaunay triangulationsCHONG-WEI HUANG; TIAN-YUAN SHIH.Computers & geosciences. 1998, Vol 24, Num 2, pp 193-196, issn 0098-3004Article

A procedure for automatically correcting invalid flat triangles occuring in triangulated contour dataWARE, J. M.Computers & geosciences. 1998, Vol 24, Num 2, pp 141-150, issn 0098-3004Article

Assessing geometric algorithms : some comments arising from the paper fast topological construction of Delaunay triangulations and Voronoi diagrams by Victor J.D. TsaiTIPPER, J.C.Computers & geosciences. 1995, Vol 21, Num 3, pp 433-436, issn 0098-3004Article

An implementation of Watson's algorithm for computing 2-dimensional Delaunay triangulationsSLOAN, S. W; HOULSBY, G. T.Advances in engineering software (1978). 1984, Vol 6, Num 4, pp 192-197, issn 0141-1195Article

Reconstruction de structures géologiques à partir de données incomplètes = Reconstruction of geological structures from incomplete dataBOISSONAT, J.-D; NULLANS, S.Documents du BRGM. Techniques et méthodes. 1997, Num 274, pp 92-95Conference Paper

Géométrie algorithmique = Computational geometryBERSTEL, J; POCCHIOLA, M.Le Courrier du C.N.R.S. 1993, Num 80, pp 58-59, issn 0153-985XArticle

Computational geometry and the design of aperture-synthesis telescopes. I. A measure of the quality of the uv-plane coverageWEBSTER, A. S.Astronomy and astrophysics (Berlin. Print). 2004, Vol 427, Num 1, pp 377-386, issn 0004-6361, 10 p.Article

Pyramides de triangulationsPASQUIER, B.Bulletin du Comité français de cartographie. 1988, Num 115, pp 59-63, issn 0755-7647Conference Paper

A NOTE ON LEE AND SCHACHTER'S ALGORITHM FOR DELAUNAY TRIANGULATIONSHAPIRO M.1981; INT. J. COMPUTER INF. SCI.; ISSN 0091-7036; USA; DA. 1981; VOL. 10; NO 6; PP. 413-418; BIBL. 3 REF.Article

Modified DAG location for Delaunay triangulationKOLINGEROVA, Ivana.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-43591-3, 3Vol, vol. 3, 125-134Conference Paper

Evaluation of a Delaunay-based method for surface approximationPER-OLOF FJÄLLSTRÖM.Computer-aided design. 1993, Vol 25, Num 11, pp 711-719, issn 0010-4485Article

Relative neighborhood graphs in the L1-metricLEE, D. T.Pattern recognition. 1985, Vol 18, Num 5, pp 327-332, issn 0031-3203Article

Delaunay-admissibilité des triangulations de surfaces = Delaunay-conformity of surface triangulationsPEBAY, P. P; FREY, P. J.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1998, Vol 327, Num 3, pp 313-318, issn 0764-4442Article

A new compound algorithm study for delaunay triangulation constructionYIKANG RUI; JIECHEN WANG; CHENHUI QIAN et al.Proceedings of SPIE, the International Society for Optical Engineering. 2007, pp 67510B.1-67510B.8, issn 0277-786X, isbn 978-0-8194-6911-3Conference Paper

Illustrating the streaming construction of 2D delaunay triangulationsISENBURG, Martin; YUANXIN LIU; SHEWCHUK, Jonathan et al.SCG : symposium on computational geometry. 2006, pp 481-482, isbn 1-59593-340-9, 1Vol, 2 p.Conference Paper

An optimal algorithm for realizing a Delaunay triangulationLAMBERT, T.Information processing letters. 1997, Vol 62, Num 5, pp 245-250, issn 0020-0190Article

Fast topological construction of Delaunay triangulation and Voronoi diagramsTSAI, V.J.D.Computers & geosciences. 1993, Vol 19, Num 10, pp 1463-1474, issn 0098-3004Article

Approximations of set skeletonsPOPOV, A. T.SPIE proceedings series. 1998, pp 184-191, isbn 0-8194-2909-0Conference Paper

Geometry-based fully automatic mesh generation and the Delaunay triangulationSCHROEDER, W. J; SHEPHARD, M. S.International journal for numerical methods in engineering. 1988, Vol 26, Num 11, pp 2503-2515, issn 0029-5981Article

Keyframe-based video summarization using Delaunay clusteringMUNDUR, Padmavathi; YONG RAO; YESHA, Yelena et al.International journal on digital libraries (Print). 2006, Vol 6, Num 2, pp 219-232, issn 1432-5012, 14 p.Article

Delaunay triangulation of surfacesKUCWAJ, J.Zeitschrift für angewandte Mathematik und Mechanik. 1996, Vol 76, pp 487-488, issn 0044-2267, SUP3Conference Paper

TWO ALGORITHMS FOR CONSTRUCTING A DELAUNAY TRIANGULATIONLEE DT; SCHACHTER BJ.1980; INT. J. COMPUT. INF. SCI.; ISSN 0091-7036; USA; DA. 1980; VOL. 9; NO 3; PP. 219-242; BIBL. 37 REF.Article

NEITHER THE GREEDY NOR THE DELAUNAY TRIANGULATION OF A PLANAR POINT SET APPROXIMATES THE OPTIMAL TRIANGULATIONMANACHER GK; ZOBRIST AL.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 9; NO 1; PP. 31-34; BIBL. 8 REF.Article

  • Page / 24